Maximal integral simplices with no interior integer points
نویسندگان
چکیده
In this paper, we consider integral maximal lattice-free simplices. Such simplices have integer vertices and contain integer points in the relative interior of each of their facets, but no integer point is allowed in the full interior. In dimension three, we show that any integral maximal latticefree simplex is equivalent to one of seven simplices up to unimodular transformation. For higher dimensions, we demonstrate that the set of integral maximal lattice-free simplices with vertices lying on the coordinate axes is finite. This gives rise to a conjecture that the total number of integral maximal lattice-free simplices is finite for any dimension.
منابع مشابه
Volume and Lattice Points of Reflexive Simplices
Using new number-theoretic bounds on the denominators of unit fractions summing up to one, we show that in any dimension d ≥ 4 there is only one d-dimensional reflexive simplex having maximal volume. Moreover, only these reflexive simplices can admit an edge that has the maximal number of lattice points possible for an edge of a reflexive simplex. In general, these simplices are also expected t...
متن کاملLifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Recently, Andersen et al. [1] and Borozan and Cornuéjols [3] characterized the minimal inequalities of a system of two rows with two free integer variables and nonnegative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these minimal inequalities to obtain cuts from two rows of a general simplex ...
متن کامل0 M ay 2 00 7 Maximal lattice free bodies , test sets and the Frobenius problem
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral (d + 1) × d matrix A. An important ingredient is a test set for a certain integer program associated ...
متن کاملLattice point simplices
We consider simplices in [w” with lattice point vertices, no other boundary lattice points and n interior lattice points, with an emphasis on the barycentric coordinates of the interior points. We completely classify such triangles under unimodular equivalence and enumerate. For example, in a lattice point triangle with exactly one interior point, that point must be the centroid. We discuss the...
متن کاملOn cutting planes for convex mixed-integer programs
In the general mixed-integer case, the family of Chvátal-Gomory cuts does not comply with (i) and (ii) (see, for example, [8]). Therefore, we need to use a larger family of cutting planes. A polyhedron L ⊆ R is said to be lattice-free if L does not contain points of Z×R in its relative interior. An integral lattice-free cut for K is a linear inequality valid for conv(K \ rel.int(L)), where L is...
متن کامل